Tabu searching for high-level synthesis
نویسندگان
چکیده
We present here a simplified version of the High-Level Synthesis problem solved using Tabu Search. We show that the simplified problem is related to a scheduling problem in which a large set of jobs has to be sequenced and the objective is to use a minimum number of machines. For each job, a specific time window (release and due date) is known. Instead of solving the HLS problem directly, we solve the scheduling problem: “minimizing the number of late jobs” with a tabu search method. Our approach is adaptive in the sense that, in addition to the classical tabu search operators, a cycle detection method adapts the length of the tabu tenure automatically. Preliminary results on the simplified HLS problem are given. keywords: High-level synthesis, tabu search, cycle detection.
منابع مشابه
A Tabu Search Technique to Integrate Multicycle Scheduling, Resource Allocation and Binding
This paper describes a technique to integrate the three major tasks of high-level synthesis (scheduling, allocation, and binding) into one optimization step. Furthermore, a fourth task is performed to select the clock period for the design. These tasks are performed to ensure that the local timing constraints used to capture the timing requirements given by the designer in the behavioral specif...
متن کاملTabu Search Based Gate Leakage Optimization using DKCMOS Library in Architecture Synthesis
The gate-oxide (aka gate tunneling or gate) leakage due to quantum-mechanical direct tunneling of carriers across the gate dielectric of a device is a major source power dissipation for sub-65nm CMOS circuits. In this paper a high-level (aka architecture) synthesis algorithm is presented that simultaneously schedules operations and binds to modules for gate leakage optimization. The algorithm u...
متن کاملExploration-based high-level synthesis of linear analog systems operating at low/medium frequencies
This paper presents a methodology for high-level synthesis of continuous-time linear analog systems. Synthesis results are architectures of op-amps, sized resistors and capacitors such that their ac behavior and total silicon area are optimized. Bounds for op-amp dc gain, unity-gain frequency, input, and output impedances are found as a byproduct of synthesis. Subsequently, a circuit synthesis ...
متن کاملAn application-level synthesis methodology for multidimensional embedded processing systems
The implementation of multidimensional systems in embedded devices is a major design challenge due to the high algorithmic complexity of the applications. The authors suggest a novel application-level synthesis methodology for those parts of the embedded application which are characterized by being Lebesgue measurable (the computation involved in signal and image processing systems is Lebesgue ...
متن کاملAn Improved Tabu Search Algorithm for Job Shop Scheduling Problem Trough Hybrid Solution Representations
Job shop scheduling problem (JSP) is an attractive field for researchers and production managers since it is a famous problem in many industries and a complex problem for researchers. Due to NP-hardness property of this problem, many meta-heuristics are developed to solve it. Solution representation (solution seed) is an important element for any meta-heuristic algorithm. Therefore, many resear...
متن کامل